Computation of Tate Pairing for Supersingular Curves over characteristic 5 and 7
نویسندگان
چکیده
We compute Tate pairing over supersingular elliptic curves via the generic BGhES[3] method for p = 5, 7. In those cases, the point multiplication by p is efficiently computed by the Frobenius endomorphism. The function in a cycle can be efficiently computed by the method of continued fraction.
منابع مشابه
Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields
After Miller’s original algorithm for the Tate pairing computation, many improved algorithms have been suggested, to name just a few, by Galbraith et al. and Barreto et al., especially for the fields with characteristic three. Also Duursma and Lee found a closed formula of the Tate pairing computation for the fields with characteristic three. In this paper, we show that a similar argument is al...
متن کاملEfficient pairing computation on supersingular Abelian varieties
We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises results of Duursma and Lee for computing the Tate pairing on supersingular elliptic curves in characteristic three. We then show how our general technique leads to a new algorithm which is about twice as fast as the Duursma-Lee...
متن کاملImplementation of Tate Pairing on Hyperelliptic Curves of Genus 2
Since Tate pairing was suggested to construct a cryptosystem, fast computation of Tate pairing has been researched recently. Barreto et. al[3] and Galbraith[8] provided efficient algorithms for Tate pairing on y = x − x + b in characteristic 3 and Duursma and Lee[6] gave a closed formula for Tate pairing on y = x − x + d in characteristic p. In this paper, we present completely general and expl...
متن کاملEfficient Computations of the Tate Pairingfor the Large MOV Degrees
The Tate pairing has plenty of attractive applications, e.g., ID-based cryptosystems, short signatures, etc. Recently several fast implementations of the Tate pairing has been reported, which make it appear that the Tate pairing is capable to be used in practical applications. The computation time of the Tate pairing strongly depends on underlying elliptic curves and definition fields. However ...
متن کاملMulti-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
This paper describes the design of a fast multi-core library for the cryptographic Tate pairing over supersingular elliptic curves. For the computation of the reduced modified Tate pairing over F3509 , we report calculation times of just 2.94 ms and 1.87 ms on the Intel Core2 and Intel Core i7 architectures, respectively. We also try to answer one important design question that surges: how many...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005